Branch Voxels and Junctions in 3D Skeletons
نویسنده
چکیده
Branch indices of points on curves (introduced by Urysohn and Menger) are of basic importance in the mathematical theory of curves, defined in Euclidean space. This paper applies the concept of branch points in the 3D orthogonal grid, motivated by the need to analyze curve-like structures in digital images. These curve-like structures have been derived as 3D skeletons (by means of thinning). This paper discusses approaches of defining branch indices for voxels on 3D skeletons, where the notion of a junction will play a crucial role. We illustrate the potentials of using junctions in 3D image analysis based on a recent project of analyzing the distribution of astrocytes in human brain tissue.
منابع مشابه
A 3D Skeletonization Algorithm for 3D Mesh Models Using a Partial Parallel 3D Thinning Algorithm and 3D Skeleton Correcting Algorithm
A three-dimensional (3D) skeletonization algorithm extracts the skeleton of a 3D model and provides it for many applications, such as 3D model classification and identification. There are three major skeletonization methodologies used in the literature, distance transform field-based methods, Voronoi diagram-based methods, and thinning-based methods. However, the existing algorithms cannot pres...
متن کاملCharacterization of Curve-Like Structures in 3D Medical Images
This paper proposes algorithms for the analysis of sets of confocal microscope images of human brain tissue which constitute a 3D volume. The identification of suitable features for curve-like structures in these volumes is required for subsequent classification. The final goal is the distinction between brain tissues of patients with different degrees of neurological deceases. The given volume...
متن کاملEecient Skeletonization of Volumetric Objects
Skeletonization promises to become a powerful tool for compact shape description, path planning and other applications. However, current techniques can seldom eeciently process real, complicated 3D data sets, such as MRI and CT data of human organs. In this paper, we present an eecient Voxel-Coding based algorithm for skeletonization of 3D voxelized objects. The skeletons are interpreted as con...
متن کاملEuclidean Skeletons of 3D Data Sets in Linear Time by the Integer Medial Axis Transform
A general algorithm for computing Euclidean skeletons of 3D data sets in linear time is presented. These skeletons are defined in terms of a new concept, called the integer medial axis (IMA) transform. The algorithm is based upon the computation of 3D feature transforms, using a modification of an algorithm for Euclidean distance transforms. The skeletonization algorithm has a time complexity w...
متن کاملSkeletonization applied to magnetic resonance angiography images
When interpreting and analysing magnetic resonance angiography images, the 3D overall tree structure and the thickness of the blood vessels are of interest. This shape information may be easier to obtain from the skeleton of the blood vessels. Skeletonization of digital volume objects denotes either reduction to a 2D structure consisting of 3D surfaces and curves, or reduction to a 1D structure...
متن کامل